Acquiring Travel Time and Network Level Origin - Destination
نویسندگان
چکیده
This paper assesses technologies that may be applicable for improving the effectiveness of high-occupancy vehicle (HOV) lane enforcement, and describes a test application that is being conducted on the East R.L. Thornton Freeway (I-30) Contraflow HOV Lane in Dallas, Texas. The Texas Transportation Institute has identified and investigated several technologies that potentially could improve the safety and cost-effectiveness of enforcing HOV facilities. Several technologies, including video, automatic vehicle identification and machine vision, were subjectively evaluated on their ability to automatically determine vehicle occupancy. Based upon these subjective evaluations, researchers decided to further investigate the use of video in HOV lane enforcement. A demonstration test and subsequent video analyses determined that current pattern recognition algorithms would not be sufficient to automatically determine vehicle occupancy. Results of the demonstration test did reveal that high-quality video used in conjunction with automatic license plate readers could be very useful in making the HOV enforcement process semi-automatic. A video-based review and enforcement system is currently in process with a one-year operational test on the East R.L. Thornton Freeway HOV Lane. The results of the operational test will be used in determining whether video technology may be applied to existing HOV lanes in urban areas or other future HOV lanes in Dallas.
منابع مشابه
Finding the nearest facility for travel and waiting time in a transport network
One of user's queries from navigation service is to find the nearest facility in terms of time. The facility that is being questioned by the user as a destination may have a queuing service system (e.g. bank), which means that the cost function of the shortest path includes the waiting time at the destination as well as the travel time. This research conducts in the zone 1 of Mashhad with Bank ...
متن کاملDifferent Network Performance Measures in a Multi-Objective Traffic Assignment Problem
Traffic assignment algorithms are used to determine possible use of paths between origin-destination pairs and predict traffic flow in network links. One of the main deficiencies of ordinary traffic assignment methods is that in most of them one measure (mostly travel time) is usually included in objective function and other effective performance measures in traffic assignment are not considere...
متن کاملCapacitated Single Allocation P-Hub Covering Problem in Multi-modal Network Using Tabu Search
The goals of hub location problems are finding the location of hub facilities and determining the allocation of non-hub nodes to these located hubs. In this work, we discuss the multi-modal single allocation capacitated p-hub covering problem over fully interconnected hub networks. Therefore, we provide a formulation to this end. The purpose of our model is to find the location of hubs and the ...
متن کاملA Direct Demand Model of Departure Time and Mode for Intercity Passenger Trips
Travel demand is well announced as a crucial component of transportation planning. This paper aims to develop a direct demand model, denoting a more acceptable abstraction of reality, for intercity passengers in daily work and leisure trips in Tehran province. The model utilizes combined estimation across the data source, collected in 2011, of travelers originating from ...
متن کاملیک نگرش ترکیب سطوح برای تخمین ماتریس مبدأ و مقصد در شبکههای بزرگ مقیاس
Transportation problems are usually considered in large-scale networks, where finding the optimal solution of these problems is so time-consuming and costly. Therefore, a useful method to solve the large-scale network problems is dividing them into some smaller sub-problems. In this paper, for the first time, the origin-destination (o-d) matrix estimation problem is considered through a mixed p...
متن کاملThe Lagrangian Relaxation Method for the Shortest Path Problem Considering Transportation Plans and Budgetary Constraint
In this paper, a constrained shortest path problem (CSP) in a network is investigated, in which some special plans for each link with corresponding pre-determined costs as well as reduction values in the link travel time are considered. The purpose is to find a path and selecting the best plans on its links, to improve the travel time as most as possible, while the costs of conducting plans do ...
متن کامل